This makes prbfm a promising emerging game - tree search algorithm in future chip multiprocessor platforms 這使得prbfm成為將來(lái)多核處理器( cmp )多線程游戲樹(shù)搜索benchmark的一個(gè)有力的備選算法。
Game - tree search plays an important role in the field of artificial intelligence . in this paper we characterize and compare two parallel game - tree search workloads in chess on two intel xeon 游戲樹(shù)搜索( game - treesearch )一直以來(lái)在人工智能領(lǐng)域扮演著極其重要的角色,并行游戲樹(shù)搜索更是該領(lǐng)域的熱點(diǎn)研究問(wèn)題。